Willard Cates, Jr

Willard Thompson

Complexity theory has a profound influence on the field of cryptology. The time complexity of breaking a cipher system must be significant enough to thwart any adversary from succeeding. However, with the emergence of quantum computers an adversary may have no difficulty in breaking known cipher systems. If quantum computers would exist today new mechanisms for security would need to be built. ...

Computing LOGCFL certi#cates

The complexity class LOGCFL consists of all languages (or decision problems) which are logspace reducible to a context-free language. Since LOGCFL is included in AC, the problems in LOGCFL are highly parallelizable. By results of Ruzzo (JCSS 21 (1980) 218), the complexity class LOGCFL can be characterized as the class of languages accepted by alternating Turing machines (ATMs) which use logarit...

Willard Burr Soper

Improving Performance in Global PKI using Virtual Certi cates and Synthetic Certi cates

| A digital certi cate may be used to inform the world of the public key of its owner. To guard against impersonations and fraud, the receiver needs to perform a series of checks. When a hierarchy of certi cates is involved, and when there are large volumes of messages between two parties, as is frequent in commerce, the repeated validation of the same chain of certi cates consume signi cant re...

Samual Willard: An Unreliable Narrator